The induced path function, monotonicity and betweenness
نویسندگان
چکیده
The induced path function J(u, v) of a graph consists of the set of all vertices lying on the induced paths between vertices u and v. This function is a special instance of a transit function. The function J satisfies betweenness if w ∈ J(u, v) implies u / ∈ J(w, v) and x ∈ J(u, v) implies J(u, x) ⊆ J(u, v), and it is monotone if x, y ∈ J(u, v) implies J(x, y) ⊆ J(u, v). The induced path function of a connected graph satisfying the betweenness and monotone axioms are characterized by transit axioms.
منابع مشابه
Continuity, completeness, betweenness and cone-monotonicity
A non-trivial, transitive and reflexive binary relation on the set of lotteries satisfying independence that also satisfies any two of the following three axioms satisfies the third: completeness, Archimedean and mixture continuity (Dubra (2011)). This paper generalizes Dubra’s result in two ways: First, by replacing independence with a weaker betweenness axiom. Second, by replacing independenc...
متن کاملTriangle path transit functions, betweenness and pseudo-modular graphs
The geodesic and induced path transit functions are the two well-studied interval functions in graphs. Two important transit functions related to the geodesic and induced path functions are the triangle path transit functions which consist of all vertices on all u, v-shortest (induced) paths or all vertices adjacent to two adjacent vertices on all u, v-shortest (induced) paths, for any two vert...
متن کاملThe induced path convexity, betweenness, and svelte graphs
The induced path interval J (u; v) consists of the vertices on the induced paths between u and v in a connected graph G. Di-erences in properties with the geodesic interval are studied. Those graphs are characterized, in which the induced path intervals de/ne a proper betweenness. The intersection of the induced path intervals between the pairs of a triple, in general, consists of a big chunk o...
متن کاملComplex Networks: Traffic Dynamics, Network Performance, and Network Structure
This paper explores traffic dynamics and performance of complex networks. Complex networks of various structures are studied. We use node betweenness centrality, network polarization, and average path length to capture the structural characteristics of a network. Network throughput, delay, and packet loss are used as network performance measures. We investigate how internal traffic, through put...
متن کاملAlpha Current Flow Betweenness Centrality
A class of centrality measures called betweenness centralities reflects degree of participation of edges or nodes in communication between different parts of the network. The original shortest-path betweenness centrality is based on counting shortest paths which go through a node or an edge. One of shortcomings of the shortest-path betweenness centrality is that it ignores the paths that might ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 158 شماره
صفحات -
تاریخ انتشار 2010